When distributed computation is communication expensive

Evolution of contingent altruism when cooperation is expensive.

The ubiquity of cooperation has motivated a major research program over the last 50 years to discover ever more minimal conditions for the evolution of altruism. One important line of work is based on favoritism toward those who appear to be close relatives. Another important line is based on continuing interactions, whether between individuals (e.g., reciprocity) or between lines of descent in...

Communication and Computation in Distributed CSP Algorithms

We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance ...

Minimizing Communication Costs of Distributed Local Computation∗

A valuation algebra offers a suitable framework to represent knowledge and information. Based on this framework, several algorithms to process knowledge and pooled under the name local computation were mapped out in recent years. This paper proposes an extension of the valuation algebra framework that allows to express the costs of transmitting valuations between network hosts. Based on this mo...

Depth-Bounded Communication Complexity for Distributed Computation

"!# $% !# &' )( * +& , -.-/ &0 21 , 3& , -3! 4) '5 ) 6 78 9 ;:< 3 ;:<,=! *> & 4)4) . % !? @$ @ ' A& , -.! B @1 , ? @4<&', -.!#, ' > 0C DE* F, ! -. G0 2 , H, 7 I; &' )( J K ,L-. 1 -. G + @-3, > 3, M MN, $%-3 2 , O 95 &B*? +78 9 ;:< O * % + 6: , !? @$ 0C P @$% Q *? 2 R * ,@ , A, MS& , -.-/ &0 2 , 3 ! * * , 4 T7# F&0 @! $% T ,U$% 'V? &' * J % -W!# $%MN, $%-A @ & C 6 !? @$ & 4X @$ Y:< K:E 4 4 MZ,>&...

When are effective medications just too expensive?